Weak convergence of random p-mappings and the exploration process of inhomogeneous continuum random trees
نویسندگان
چکیده
منابع مشابه
Weak convergence of random p-mappings and the exploration process of inhomogeneous continuum random trees
We study the asymptotics of the p-mapping model of random mappings on [n] as n gets large, under a large class of asymptotic regimes for the underlying distribution p. We encode these random mappings in random walks which are shown to converge to a functional of the exploration process of inhomogeneous random trees, this exploration process being derived (Aldous-Miermont-Pitman 2004) from a bri...
متن کاملCutting down $\mathbf p$-trees and inhomogeneous continuum random trees
We study a fragmentation of the p-trees of Camarri and Pitman [Elect. J. Probab., vol. 5, pp. 1–18, 2000]. We give exact correspondences between the p-trees and trees which encode the fragmentation. We then use these results to study the fragmentation of the ICRTs (scaling limits of p-trees) and give distributional correspondences between the ICRT and the tree encoding the fragmentation. The th...
متن کاملThe exploration process of inhomogeneous continuum random trees, and an extension of Jeulin's local time identity
We study the inhomogeneous continuum random trees (ICRT) that arise as weak limits of birthday trees. We give a description of the exploration process, a function defined on [0, 1] that encodes the structure of an ICRT, and also of its width process, determining the size of layers in order of height. These processes turn out to be transformations of bridges with exchangeable increments, which h...
متن کاملOn the convergence of three-step random iterative procesess with errors of nonself asymptotically nonexpansive random mappings
begin{abstract} In this paper, we prove some strong and weak convergence of three step random iterative scheme with errors to common random fixed points of three asymptotically nonexpansive nonself random mappings in a real uniformly convex separable Banach space. end{abstract}
متن کاملHighest Trees of Random Mappings
We prove the exact asymptotic 1 − Θ( 1 √ n ) for the probability that the underlying graph of a random mapping of n elements possesses a unique highest tree. The property of having a unique highest tree turned out to be crucial in the solution of the famous Road Coloring Problem [7] as well as in the proof of the author’s result about the probability of being synchronizable for a random automat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Probability Theory and Related Fields
سال: 2005
ISSN: 0178-8051,1432-2064
DOI: 10.1007/s00440-004-0407-2